There are several approaches for Radio RESOURCE Management (RRM) in multicarrier cellular systems. This work analyzes and compares two of them: rate-ADAPTIVE RESOURCE ALLOCATION (sub-carriers and power) based on instantaneous data rates, and utility-based packet scheduling based on average data rates. A fundamental RRM problem in wireless cellular networks was chosen as a background to evaluate the aforementioned approaches: the trade-off between system spectral efficiency and fairness among the users when opportunistic ALLOCATION is used. Extensive system-level simulations were performed and important network metrics such as total cell throughput, mean user throughput, system fairness index and user satisfaction were assessed. It was concluded from the simulation results that it is possible to achieve an efficient trade-off between RESOURCE efficiency and fairness using any of the two RRM approaches. However, utility-based packet scheduling algorithms based on average data rates have the advantage of presenting higher user satisfaction with less computational complexity.

The ever increasing demand of the subscribers has put pressure on the capacity of wireless networks around the world. To utilize the scare RESOURCEs, in the present paper we propose an optimal ALLOCATION scheme for an integrated wireless/cellular model with handoff priority and handoff guarantee services. The suggested algorithm optimally allocates the RESOURCEs in each cell and dynamically adjust threshold to control the admission. To give the priority to handoff calls over the new calls, the provision of guard channels and subrating scheme is taken into consideration.The handoff voice call may balk and renege from the system while waiting in the buffer. An iterative algorithm is implemented to generate the arrival rate of the handoff calls in each cell. Various performance indices are established in term of steady state probabilities. The sensitivity analysis has also been carried out to examine the tractability of algorithms and to explore the effects of system descriptors on the performance indices.

In DEA to obtain an efficient representation in CCR and BCC models for each DMU only one linear plan would be solved; however, it is possible in centralized RESOURCE ALLOCATION (CRA) to solve all the DMUs by one linear planning. In this paper, models of centralized RESOURCE ALLOCATION in input-oriented and in dynamic case will be offered and by using dynamic SBM, the representation of DMUs in each time period and in general and based on CRA in input oriented case will be obtained. After that, the theorems of the offered models will be shown and at least, an applicable example will be represented.

The purpose of this study is to design a RESOURCE ALLOCATION model in educational organizations. In this research, the statistical society was defined in two formats. The research method is a survey and statistically of a type of development. The sampling method was used in the research in the experts section of the census type and in the educational-oriented organizations of the simple cluster type. In this research, to increase the validity of the questionnaire, a questionnaire was prepared, then articles, books and journals were designed and then questioned with a number of professors, and questions were considered. Then, a number of questionnaires were distributed among each section of the statistical society and all ambiguities were identified and resolved and the final questionnaire was distributed. Since the questionnaires are made up of a series of indicators or criteria, their reliability is unnecessary. Delphi analysis method and AHP hierarchical analysis method were used to analyze the data. In Delphi analysis, 23 factors were identified in the form of three dimensions of financial, physical, technological and human RESOURCEs. Also, the results of the AHP hierarchical analysis showed that financial costs have the highest priority among dimensions. After that, physical and technological RESOURCEs have been prioritized.

In this paper, downlink RESOURCE ALLOCATION for a sparse code multiple access (SCMA) based heterogeneous cellular networks (HCN) is investigated. The main aim of this paper is to obtain joint power ALLOCATION and codebook assignment to achieve the least total system transmit power. In this regard, the proposed objective function is formulated as total transmit power subject to users minimum rate requirement, total available power in each base station (BS), and SCMA constraint. To solve the proposed problem an iterative algorithm considering successive convex approximation (SCA) is applied. Also, convergence of the iterative method is investigated. In the simulation results the effectiveness of proposed RESOURCE ALLOCATION method are shown.